Using hyper populated ant colonies for solving the TSP

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Fuzzy TSP with Ant Algorithms

In this paper we describe the first Ant algorithm designated for fuzzy TSP (FTSP). Our work consists of two parts. The former part is dedicated to FTSP specification. The latter transforms the Ant System (chronologically the first Ant algorithm) in order to tackle the FTSP, and implement the new algorithm on a FTSP instance.

متن کامل

Annealing Ant Colony Optimization with Mutation Operator for Solving TSP

Ant Colony Optimization (ACO) has been successfully applied to solve a wide range of combinatorial optimization problems such as minimum spanning tree, traveling salesman problem, and quadratic assignment problem. Basic ACO has drawbacks of trapping into local minimum and low convergence rate. Simulated annealing (SA) and mutation operator have the jumping ability and global convergence; and lo...

متن کامل

An Improved Ant Colony Optimization Algorithm for Solving TSP

The basic ant colony optimization (ACO) algorithm takes on a longer computing time in the search process and is prone to fall into local optimal solutions, an improved ACO (CEULACO) algorithm is proposed in this paper. In the CEULAC algorithm, the direction guidance and real variable function are used to initialize pheromone concentration according to the path information of undirected graph. T...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Solving TSP using DARO

Travelling Salesperson Problem is finding a Hamiltonian cycle with minimum weight. The paper presents solution travelling salesperson problem with Genetic Algorithm. Dynamic allocation of reproduction operators and social disaster technique are used for generating the population and based on the convergence analysis of evaluation process. The method is demonstrated and found to be effective in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Vietnam Journal of Computer Science

سال: 2016

ISSN: 2196-8888,2196-8896

DOI: 10.1007/s40595-016-0059-z